Discontinuous transition to loop formation in optimal supply networks
نویسندگان
چکیده
منابع مشابه
Optimal routing in double loop networks
In this paper, we study the problem of finding the shortest path in circulant graphs with an arbitrary number of jumps. We provide algorithms specifically tailored for weighted undirected and directed circulant graphs with two jumps which compute the shortest path. Our method only requires O(log N ) arithmetic operations and the total bit complexity is O(log2 N log log N log log log N ), where ...
متن کاملContinuum modeling of supply chain networks using discontinuous Galerkin methods
Using a connectivity matrix, we establish a continuum modeling approach with partial differential equations of conservation laws for simulating materials flow in supply chain networks. A number of existing and new constitutive relationships for modeling velocity are summarized or proposed. To effectively treat strong advection components within the modeling system, we apply discontinuous Galerk...
متن کاملpredicting intention to adopt interorganizational linkages: a study in iranian automative indusrty supply chain in b2b environment
در این پایان نامه مسایل مربوط به ارتباطاط سازمانی و نحوه تاثیر گذاری فناوری اطلاعات بر روی آنها بررسی میشود. انواع مدلهای سازمانی و بررسی متغیرهای مختلف بصورت آماری از اهداف این پایان نامه می باشد. ارتباطاط edi در محیط های b2b هدف اصلی مدل های بررسی شده می باشد.
15 صفحه اولAn efficient algorithm to find optimal double loop networks
The problem of finding optimal diameter double loop networks with a fixed number of vertices has been widely studied. In this work, we give an algorithmic solution of the problem by using a geometrical approach. Given a fixed number of vertices n, the general problem is to find "steps" s 1 , s z e ~',, such that the digraph G(n; sl,s2) with set of vertices V = 7 / a n d adjacencies given by i ~...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Communications
سال: 2020
ISSN: 2041-1723
DOI: 10.1038/s41467-020-19567-2